Search results for "Reliable multicast"
showing 8 items of 8 documents
What's New for QoS in IEEE 802.11?
2013
Two amendments to IEEE 802.11 have recently been published: 802.11aa and 802.11ae. Both enhance Quality of Service (QoS) provisioning in Wi-Fi networks by providing support for multicast transmission, enhanced audio video streaming, coping with inter-network interference, and improved prioritization of management frames. The proposed solutions either extend mechanisms already existing in the standard or introduce new ones. Therefore, it is important for researchers to understand the new functionalities. To this end we provide the first description of these latest mechanisms: we present the motivation behind them, explain their design principles, provide examples of usage, and comment on com…
MCD: Overcoming the Data Download Bottleneck in Data Centers
2013
The data download problem in data centers describes the increasingly common task of coordinated loading of identical data to a large number of nodes. Data download is seen as a significant problem in exascale HPC applications. Uncoor-dinated reading from a central file server creates contention at the file server and its network interconnect. We propose and evaluation a reliable multicast based approach to solve the data download problem. The MCD system builds a logical multi-rooted tree based on the physical network topology and uses the logical view for a two-phase approach. In the first phase, the data is multicasted to all nodes. In the second phase, the logical tree is used for an effi…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
Reliable Multicast D2D Communication Over Multiple Channels in Underlay Cellular Networks
2020
Multicast device-to-device (D2D) communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to the nearby receivers. However, due to critical challenges such as, mitigating mutual interference and unavailability of perfect channel state information (CSI), the resource allocation to multicast groups needs significant attention. In this work, we present a framework for joint channel assignment and power allocation strategy to maximize the sum rate of the combined network. The proposed framework allows access of multiple channels to the multicast groups, thus improving the achievable rate of the individual groups. Furthermore, fairness in …
Enabling Retransmissions for Achieving Reliable Multicast Communications in WSNs
2016
To ensure end-to-end reliable multicast or broadcast transmissions in IEEE 802.15.4 based wireless sensor networks WSNs) is a challenging task since no retransmission and acknowledgment mechanisms are defined in such WSNs. In this paper, we propose three retransmission enabled multicast transmission schemes in order to achieve reliable packet transmissions in such networks. Different from the legacy CSMA/CA principle, these schemes allow a sending or forwarding node to retransmit a packet if necessary and enable implicit or/and explicit acknowledgment for multicast services. Simulations are performed in order to assess the performance of these schemes in terms of number of retransmissions, …
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
Multicast access control concept for xDSL-customers
2006
Multicast is a tempting possibility for many broad- band services. It makes possible to deliver one data-stream to several receivers simultaneously. IP-Multicast is based on an open group concept. This means that it is possible for all the users to join the group and thus receive the data. The open concept is also the main reason why multicast has not been taken in wider use. There is two different solution to solve this problem, group access control and multicast data encryption. Group access control mechanisms focuses on restricting the group membership at the users edge device. Traffic encryption scheme relies on end-to-end encryption, so a key management architecture is also needed. We …
Quality of Service Multicasting over Differentiated Services Networks
2003
This paper proposes a solution to support real-time multicast traffic with Quality of Service (QoS) constraints over Differentiated Services (DiffServ) IP networks. Our solution allows multicast users to dynamically join and leave the multicast tree. Moreover, it allows a multicast user which has negotiated a best-effort session to upgrade to a QoS-enabled session. Our solution is backward compatible with the Protocol Independent Multicast (PIM) scheme. It combines two ideas. First, resource availability along a new QoS path is verified via a probe-based approach. Second, QoS is maintained by marking replicated packets with a special DSCP value, before forwarding them on the QoS path.